Circuit complexity - PDFSEARCH.IO - Document Search Engine

Circuit complexity
Results: 364

#	Item
111	This article was downloaded by: [Chinese University of Hong Kong] On: 08 April 2013, At: 23:00 Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: [removed]Registered office: Mortimer House Add to Reading List Source URL: mentalmodels.princeton.edu Language: English - Date: 2013-04-09 12:52:39 Mathematical logic Boolean circuit Computational complexity theory Logic in computer science Boolean algebra Switch Railroad switch Reverse engineering Nonblocking minimal spanning switch Algebraic logic Theoretical computer science Mathematics
112	Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-06-27 11:58:26 NP-complete problems Clique Matching Maximal independent set Independent set Circuit complexity Path decomposition Bipartite dimension Graph theory Theoretical computer science Mathematics
113	Lower Bounds for Monotone Counting Circuits Stasys Jukna1,2 Institute of Computer Science, Goethe University, Frankfurt am Main, Germany Abstract A {+, ×}-circuit counts a given multivariate polynomial f , if its values Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2015-01-31 16:25:52 Abstract algebra Homogeneous polynomial Circuit complexity Arithmetic circuit complexity Tutte polynomial Mathematics Algebra Polynomials
114	Lower Bounds for Tropical Circuits and Dynamic Programs∗ Stasys Jukna University of Frankfurt, Institute of Computer Science, Germany Vilnius University, Institute of Mathematics and Informatics, Vilnius, Lithuania juk Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2015-02-05 11:02:38 Algebraic structures Algebraic geometry Ring theory Polynomials Circuit complexity Arithmetic circuit complexity Semiring Monomial Tropical geometry Algebra Mathematics Abstract algebra
115	Privacy-Preserving Set Operations Lea Kissner Dawn Song Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2006-11-19 16:59:50 Polynomials Commutative algebra Multiset Invariant theory IP Computer algebra Factorization of polynomials over a finite field and irreducibility tests Arithmetic circuit complexity Abstract algebra Mathematics Algebra
116	The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the ﬁfth year the EACSL Ackermann Award is generously sponsored. Our sponsor f Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Computational complexity theory Finite model theory Circuit complexity Clique problem Clique Wilhelm Ackermann Logic Switching lemma Descriptive complexity theory Theoretical computer science Mathematics Applied mathematics
117	On Graph Complexity S . J U K N A† Universit¨ at Frankfurt, Institut f¨ ur Informatik Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2009-01-04 06:50:40 Circuit complexity Computational complexity theory Complexity classes AC Clique Parity function Boolean circuit Matching Circuit Theoretical computer science Mathematics Graph theory
118	Contents Part I The Basics Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-03-10 09:16:28 Complexity classes Circuit complexity Natural proof Switching lemma ACC0 NC P Binary decision diagram Clique Theoretical computer science Computational complexity theory Applied mathematics
119	Quantum boolean functions Ashley Montanaro1 and Tobias Osborne2 1 Department of Computer Science University of Bristol Add to Reading List Source URL: www.damtp.cam.ac.uk Language: English - Date: 2008-12-02 21:52:10 Boolean algebra Computational complexity theory Joseph Fourier Integral transforms Circuit complexity Boolean function Parity function Decision tree model Fourier transform Theoretical computer science Applied mathematics Mathematics
120	Symmetric functions of qubits in an unknown basis Ashley Montanaro Department of Computer Science, University of Bristol, Woodland Road, Bristol, BS8 1UB, U.K.∗ (Dated: June 18, 2009) Consider an n qubit computational Add to Reading List Source URL: www.damtp.cam.ac.uk Language: English - Date: 2009-06-18 03:21:13 Quantum information science Models of computation Combinatorics Quantum complexity theory Probabilistic complexity theory Quantum circuit PP Permutation Randomized algorithm Theoretical computer science Mathematics Applied mathematics

UPDATE